1 Bidding Strategies in Internet Yankee Auctions
نویسندگان
چکیده
A bidding strategy commonly observed in Internet auctions, though not frequently in live auctions, is that of “jump-bidding,” or entering a bid larger than necessary to be a current high bidder. In this paper, we argue that the cost associated with entering on-line bids and the uncertainty concerning bidding competition -both of which distinguish Internet from live auctions -can explain this phenomenon. We present a simple theoretical model that accounts for the preceding characteristics, and derive the conditions under which jump-bidding constitutes an equilibrium strategy in a format commonly used for on-line trading, the Yankee Auction. We then present evidence recorded from hundreds of Internet auctions that is consistent with the basic predictions from our model. We find that jump-bidding is more likely earlier in an Internet auction, when jumping has a larger strategic value, and that the incentives to jump bid increase as bidder competition becomes stronger. Several of our results have implications for starting bid and minimum bid increment rules set by Internet auction houses. We also discuss possible means of reducing bidding costs, and evidence that Internet auctioneers are pursuing this goal.
منابع مشابه
Replicating Online Yankee Auctions to Analyze Auctioneers' and Bidders' Strategies
Dynamic price setting mechanisms such as online auctions typify the new generation of mercantile processes being used on the WWW. However, arbitrary pricing mechanisms can result in loss of revenue and social capital in markets characterized by tight margins. This work presents a relatively risk-free and cost-effective approach to managing innovation in the area of web-based dynamic price setti...
متن کاملAn Optimal Auction Infrastructure Design: An Agent-based Simulation Approach
This paper presents an agent-based simulation approach to estimate the effects of auction parameters on the auction outcomes, and to find an optimal or, at least, close to an optimal infrastructure. In particular, this study intends to study how bidders’ personalities and bidding strategies with other auction parameters affect the closing prices in two auction mechanisms: English and Yankee auc...
متن کاملInternet Auctions with ArtiÞcial Adaptive Agents: On Evolution of Late Bidding∗
Many internet auction sites implement ascending-bid auctions. Empirically, late bidding is frequently observed in hard-close auctions. In soft-close auctions, late bidding is less frequently observed. In this paper, we introduce an independent privatevalue repeated internet auction model to explain the observed bidding behavior. We use Þnite automata to model repeated auction strategies. ...
متن کاملOptimal Bidding Strategies of GENCOs in Day-Ahead Energy and Spinning Reserve Markets Based on Hybrid GA-Heuristic Optimization Algorithm
In an electricity market, every generation company (GENCO) attempts to maximize profit according to other participants bidding behaviors and power systems operating conditions. The goal of this study is to examine the optimal bidding strategy problem for GENCOs in energy and spinning reserve markets based on a hybrid GA-heuristic optimization algorithm. The heuristic optimization algorithm used...
متن کاملRepeat Bidding on Internet-Based Multiple-Item "Name-Your-Own-Price" Auctions
Name-Your-Own-Price (NYOP) auctions have gained recent popularity on the Internet. In many NYOP settings, the auction firm displays multiple bidding items for the bidders (such as multiple options of airline tickets) and restricts them to place a single offer. Recent studies have, however, shown that the Internet environment enables many customers to engage in repeat bidding. Our purpose in thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001